New Linear Codes over $GF(3)$, $GF(11)$, and $GF(13)$
نویسندگان
چکیده
منابع مشابه
New linear codes over 𝔽9
Let dg (n, k) be the maximum possible minimum Hamming distance of a linear [n, k] code over lFg• In this paper, twenty-four new linear codes over lFg are constructed which improve the table of dg(n, k) by Brouwer. Four of these codes meet the upper bound on dg (n, k) and so are optimal. A geometric interpretation of the small dimensional codes is also given.
متن کاملNew linear codes over GF(8)1
Let [n, k, d]q-code be a linear code of length n, dimension k and minimum Hamming distance d over GF (q). One of the most important problems in coding theory is to construct codes with best possible minimum distances. Recently, the class of quasi-cyclic (QC) codes has been proven to contain many such codes. In this paper, thirty two codes over GF (8) are constructed (among them one optimal code...
متن کاملOptimal Linear Codes Over GF(7) and GF(11) with Dimension 3
Let $n_q(k,d)$ denote the smallest value of $n$ for which there exists a linear $[n,k,d]$-code over the Galois field $GF(q)$. An $[n,k,d]$-code whose length is equal to $n_q(k,d)$ is called {em optimal}. In this paper we present some matrix generators for the family of optimal $[n,3,d]$ codes over $GF(7)$ and $GF(11)$. Most of our given codes in $GF(7)$ are non-isomorphic with the codes pre...
متن کاملNew Linear Codes over Zps via the Trace Map
The trace map has been used very successfully to generate cocyclic complex and Butson Hadamard matrices and simplex codes over Z4 and Z2s . We extend this technique to obtain new linear codes over Zps . It is worth nothing here that these codes are cocyclic but not simplex codes. Further we find that the construction method also gives Butson Hadamard matrices of order p.
متن کاملNew minimum distance bounds for linear codes over GF(5)
Let [n; k; d]q-codes be linear codes of length n, dimension k and minimum Hamming distance d over GF(q). In this paper, 32 new codes over GF(5) are constructed and the nonexistence of 51 codes is proved. c © 2003 Elsevier B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra Combinatorics Discrete Structures and Applications
سال: 2019
ISSN: 2148-838X
DOI: 10.13069/jacodesmath.508968